A Higher-Order Simulation Relation for System F

The notion of data type speciication reenement is discussed in a setting of System F and the logic for parametric polymorphism of Plotkin and Abadi. At rst order, one gets a notion of speciication reenement up to observational equivalence in the logic simply by using Luo's formalism. This paper generalises this notion to abstract data types whose signatures contain higher-order and polymorphic functions. At higher order, the tight connection in the logic between the existence of a simulation relation and observational equivalence ostensibly breaks down. We show that an alternative notion of simulation relation is suitable. This also gives a simulation relation in the logic that composes at higher order, thus giving a syntactic logical counterpart to recent advances on the semantic level.